منابع مشابه
Net Refinement by Pullback Rewriting
The notion of pullback rewriting has been developed recently as a category theoretical framework for vertex replacement in graphs. Here, the technique is presented based on net morphisms, yielding a well-deened mechanism which is closely related to pullback rewriting in hypergraphs. Finally, a net reenement operation modifying the context of the reened transition is characterized in terms of pu...
متن کاملA Uniform Approach to Graph Rewriting: The Pullback Approach
Most of the works in the theory of graph rewriting can be put into two main categories : edge (or hyperedge) rewriting and node rewriting. Each has been described by a speciic formalism, both have given rise to many signiicant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framew...
متن کاملParallel rewriting of graphs through the pullback approach
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...
متن کاملPartial Order Infinitary Term Rewriting
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a cons...
متن کاملSingle-Pushout Rewriting of Partial Algebras
We introduce Single-Pushout Rewriting for arbitrary partial algebras. Thus, we give up the usual restriction to graph structures, which are algebraic categories with unary operators only. By this generalisation, we obtain an integrated and straightforward treatment of graphical structures (objects) and attributes (data). We lose co-completeness of the underlying category. Therefore, a rule is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.006